Penerapan Algoritma FP-Growth dalam Penentuan Promosi Kampus

نویسندگان

چکیده

Campus or college is an institution as well that included in the education sector. Now campus a business sector engaged education. Therefore, also inseparable from promotion process. The carried out by has aim of making prospective new students register on campus. For private campuses, are input can be useful to continue operational process for problem still widely found at this time determining promotions based assumptions. Where assumptions used not fact special reference. Determination seen data who have registered actively From student data, it processed Regional Origin, School Department and Study Program taken. Data mining technique large amounts data. Frequent Pattern Growth Algorithm (FP-Growth) algorithm association technique. results obtained study strategy if you take = Informatics Engineering (PS1) then Science (J1) Origin Deli Serdang (AD1) with Support value 30% Confidence 60% (J1), 75%. Based was out, target Serdang, interest Engineering.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Klasifikasi Data Cardiotocography Dengan Integrasi Metode Neural Network Dan Particle Swarm Optimization

Backpropagation (BP) adalah sebuah metode yang digunakan dalam training Neural Network (NN) untuk menentukan parameter bobot yang sesuai. Proses penentuan parameter bobot dengan menggunakan metode backpropagation sangat dipengaruhi oleh pemilihan nilai learning rate (LR)-nya. Penggunaan nilai learning rate yang kurang optimal berdampak pada waktu komputasi yang lama atau akurasi klasifikasi yan...

متن کامل

nonordfp: An FP-growth variation without rebuilding the FP-tree

We describe a frequent itemset mining algorithm and implementation based on the well-known algorithm FPgrowth. The theoretical difference is the main data structure (tree), which is more compact and which we do not need to rebuild for each conditional step. We thoroughly deal with implementation issues, data structures, memory layout, I/O and library functions we use to achieve comparable perfo...

متن کامل

MS-FP-Growth: A multi-support Vrsion of FP-Growth Agorithm

In this paper, we propose a new version of FP-Growth algorithm to find association rules. In this version, we vary the minsup value from one level to another. This variation is made in two cases: increasing and decreasing the minsup value. We performed a set of experiments to validate the usefulness of our proposition in the generation of association rules process.

متن کامل

FP-GROWTH APPROACH FOR DOCUMENT CLUSTERING by

Since the amount of text data stored in computer repositories is growing every day, we need more than ever a reliable way to group or categorize text documents. Most of the existing document clustering techniques use a group of keywords from each document to cluster the documents. In this thesis, we have used a sense based approach to cluster documents instead of using only the frequency of the...

متن کامل

Pattern Mining on Stars with FP-Growth

Most existing data mining (DM) approaches look for patterns in a single table. Multi-relational DM approaches, on the other hand, look for patterns that involve multiple tables. In recent years, the most common DM techniques have been extended to the multi-relational case, but there are few dedicated to star schemas. These schemas are composed of a central fact table, linking a set of dimension...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer System and Informatics

سال: 2022

ISSN: ['2714-8912', '2714-7150']

DOI: https://doi.org/10.47065/josyc.v3i4.1911